Applying Ant Colony Optimization to configuring stacking ensembles for data mining
نویسندگان
چکیده
منابع مشابه
Applying Ant Colony Optimization to configuring stacking ensembles for data mining
An ensemble is a collective decision-making system which applies a strategy to combine the predictions of learned classifiers to generate its prediction of new instances. Early research has proved that ensemble classifiers in most cases can be more accurate than any single component classifier both empirically and theoretically. Though many ensemble approaches are proposed, it is still not an e...
متن کاملAnt Colony Optimization and Data Mining
The Ant Colony Optimization (ACO) technique was inspired by the ants' behavior throughout their exploration for food. In nature, ants wander randomly, seeking for food. After succeeding, they return to their nest. During their move, they lay down pheromone that forms an evaporating chemical path. Other ants that locate this trail, follow it and reinforce it, since they also lay down pheromone. ...
متن کاملData mining with an ant colony optimization algorithm
This paper proposes an algorithm for data mining called Ant-Miner (ant-colony-based data miner). The goal of AntMiner is to extract classification rules from data. The algorithm is inspired by both research on the behavior of real ant colonies and some data mining concepts as well as principles. We compare the performance of Ant-Miner with CN2, a well-known data mining algorithm for classificat...
متن کاملPrivacy-Preserving Data Mining Algorithm Quantum Ant Colony Optimization
Bayesian network has been used extensively in data mining. The Privacy-Preserving data mining algorithm based on quantum ant colony optimization is proposed in this paper. The algorithm is based on distributed database. The algorithm is divided into two steps. In the first step, the modified quantum ant colony optimization algorithm is used to get the local Bayesian network structure. The purpo...
متن کاملApplying Ant Colony Optimization to Dynamic Binary-Encoded Problems
Ant colony optimization (ACO) algorithms have proved to be able to adapt to dynamic optimization problems (DOPs) when stagnation behaviour is addressed. Usually, permutation-encoded DOPs, e.g., dynamic travelling salesman problems, are addressed using ACO algorithms whereas binary-encoded DOPs, e.g., dynamic knapsack problems, are tackled by evolutionary algorithms (EAs). This is because of the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Expert Systems with Applications
سال: 2014
ISSN: 0957-4174
DOI: 10.1016/j.eswa.2013.10.063